منابع مشابه
Linear time self-stabilizing colorings
We propose two new self-stabilizing distributed algorithms for proper ∆+1 (∆ is the maximum degree of a node in the graph) colorings of arbitrary system graphs. Both algorithms are capable of working with multiple type of daemons (schedulers) as is the most recent algorithm by Gradinariu and Tixeuil [OPODIS’2000, 2000, pp. 55–70]. The first algorithm converges in O(m) moves while the second con...
متن کاملSelf-Stabilizing Algorithms For Orderings And Colorings
A k-forward numbering of a graph is a labeling of the nodes with integers such that each node has less than k neighbors whose labels are equal or larger. Distributed algorithms that reach a legitimate state, starting from any illegitimate state, are called self-stabilizing. We obtain three self-stabilizing (s-s) algorithms for finding a k-forward numbering, provided one exists. One such algorit...
متن کاملLinear Time Byzantine Self-Stabilizing Clock Synchronization
Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessing self-stabilizing features are sensible and important requirements of distributed systems in general, and of a fundamental task such as clock synchronization in particular. There are efficient solutions for Byzantin...
متن کاملLinear-time Self-stabilizing Byzantine Clock Synchronization
Clock synchronization is a very fundamental task in distributed system. It thus makes sense to require an underlying clock synchronization mechanism to be highly fault-tolerant. A self-stabilizing algorithm seeks to attain synchronization once lost; a Byzantine algorithm assumes synchronization is never lost and focuses on containing the influence of the permanent presence of faulty nodes. Ther...
متن کاملSelf-Stabilizing Maximal K-Dependent Sets In Linear Time
In a graph or network G = (V;E), a set S V is k-dependent if no node in S has more than k neighbors in S. We show that for each k 0 there is a self-stabilizing algorithm that identi es a maximal k-dependent set, and stabilizes in O(m + n) time. An interesting by-product of our paper is the new result that in any graph there exists a set that is both maximal k-dependent and minimal (k+1)-dominat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2003
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(03)00299-0